linear time algorithm造句
例句與造句
- Sub-linear time algorithms arise naturally in the investigation of property testing.
- Sub-linear time algorithms are typically randomized, and provide only approximate solutions.
- A linear time algorithm was found soon afterwards by Jay Kadane of Carnegie Mellon University.
- A linear time algorithm is known to report all directions in which a given simple polygon is monotone.
- found a linear time algorithm for listing all the palindromes that appear at the start of a given string.
- It's difficult to find linear time algorithm in a sentence. 用linear time algorithm造句挺難的
- As a consequence, several algorithmic problems including subgraph isomorphism for pattern graphs of bounded size have linear time algorithms for these graphs.
- Modular decomposition is a good tool for solving the maximum weight independent set problem; the linear time algorithm on cographs is the basic example for that.
- So both the Spanning Caterpillar Problem and the MSCP have linear time algorithms if a graph is an outerplanar, a series-parallel, or a Halin graph.
- Based on this test, there also exists a linear time algorithm for finding a widest path in an undirected graph, that does not use the maximum spanning tree.
- Shamir has also made contributions to computer science outside of cryptography, such as finding the first linear time algorithm for 2-satisfiability and showing the equivalence of the IP.
- Bjarne Steensgaard presented an idea of reducing points-to analysis to type inference and type checking, thereby modeling a linear space and almost linear time algorithm for points-to set computation.
- This method does not construct linkless or flat embeddings when they exist, but an algorithm that does construct an embedding was developed by, and a more efficient linear time algorithm was found by.
- In fact, the property of a binary string having only zeros ( and no ones ) can be easily proved not to be decidable by a ( non-approximate ) sub-linear time algorithm.
- In particular, Megiddo himself used this approach in his linear time algorithm for the linear programming problem when the dimension is fixed and for the minimal enclosing sphere problem for a set of points in space.
- Henzinger et . al . extended Frederickson's " r "-division technique for the single source shortest path algorithm in planar graphs for nonnegative edge-lengths and proposed a linear time algorithm.
更多例句: 下一頁